منابع مشابه
Logarithmic behavior of some combinatorial sequences
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic behavior of some combinatorially relevant sequences, such as Motzkin and Schröder numbers, sequences of values of some classic orthogonal polynomials, and ma...
متن کاملStrong convergence on weakly logarithmic combinatorial assemblies
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the author’s analytic approach, we generalize the so-called Fundamental Lemma giving independent process approximation in the total variation distance of the compone...
متن کاملLogarithmic Market Scoring Rules for Modular Combinatorial Information Aggregation
In practice, scoring rules elicit good probability estimates from individuals, while betting markets elicit good consensus estimates from groups. Market scoring rules combine these features, eliciting estimates from individuals or groups, with groups costing no more than individuals. Regarding a bet on one event given another event, only logarithmic versions preserve the probability of the give...
متن کاملThe Number of Components in a Logarithmic Combinatorial Structure
Under very mild conditions, we prove that the number of components in a decomposable logarithmic combinatorial structure has a distribution which is close to Poisson in total variation. The conditions are satisfied for all assemblies, multisets and selections in the logarithmic class.The error in the Poisson approximation is shown under marginally more restrictive conditions to be of exact orde...
متن کاملApproximation by the Dickman distribution and quasi - logarithmic combinatorial structures ∗
Quasi-logarithmic combinatorial structures are a class of decomposable combinatorial structures which extend the logarithmic class considered by Arratia, Barbour and Tavaré (2003). In order to obtain asymptotic approximations to their component spectrum, it is necessary first to establish an approximation to the sum of an associated sequence of independent random variables in terms of the Dickm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2009
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2009.v16.n1.a18